A fast random cost algorithm for physical mapping.
نویسندگان
چکیده
منابع مشابه
A fast recursive mapping algorithm
This paper presents a generic technique for mapping parallel algorithms onto parallel architectures. The proposed technique is a fast recursive mapping algorithmwhich is a component of the Cluster-M programming tool. The other components of Cluster-M are the Speciication module and the Representation module. In the Speciication module, for a given task speciied by a high-level machine-independe...
متن کاملA Genetic Algorithm for Physical Mapping Problems
In this paper, we study a genetic algorithm for solving physical mapping problem. First, the physical mapping problem is transferred to an optimization problem by incorporating biological knowledge and limitations into the objective function. Based on the idea of genetic algorithms, the proposed approach integrates Edge Assembly Crossover (EAX) and Inver-over genetic operators to get the optima...
متن کاملA New Method for Color Gamut Mapping by Genetic Algorithm
To reproduce an image, it is necessary to map out of gamut colors of the image to destination gamut. It is clear that the best color gamut mapping introduces the perceptually closest image to the original one. In this study, a new color gamut mapping is purposed by the aid of Genetic Algorithm (GA). The color difference between the original and mapped images based on S-LAB formula was chosen as...
متن کاملFast Point Matching Algorithm for Mapping Applications
This paper presents a method for image positioning, and map creation. The images are captured by a flying modulo equipped by a camera to observe a selected area. In this study we suppose this system is located at a fixed height, and compare its mechanism to a free pendulum moving with the wind force. The camera is always pointing vertically thanks to a motored system. This system isn’t noise fr...
متن کاملA Fast Heuristic Algorithm for a Probe Mapping Problem
A new heuristic algorithm is presented for mapping probes to locations along the genome, given noisy pairwise distance data as input. The model considered is quite general: The input consists of a collection of probe pairs and a confidence interval for the genomic distance separating each pair. Because the distance intervals are only known with some confidence level, some may be erroneous and m...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the National Academy of Sciences
سال: 1994
ISSN: 0027-8424,1091-6490
DOI: 10.1073/pnas.91.23.11094